When is a regular sequence super regular?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Expression Constrained Sequence Alignment

Given strings S1, S2, and a regular expression R, we introduce regular expression constrained sequence alignment as the problem of finding the maximum alignment score between S1 and S2 over all alignments such that in these alignments there exists a segment where some substring s1 of S1 is aligned with some substring s2 of S2, and both s1 and s2 match R, i.e. s1, s2 ∈ L(R) where L(R) is the reg...

متن کامل

Regular Is Longer

The current study examined whether regularity of dot patterns would influence time perception. We presented observers the dot patterns with three levels of regularity (high, middle and low) and measured the perceived duration of each pattern by bisection and rating methods. The results revealed that the perceived duration of high regular patterns was longer than that of middle and low regular p...

متن کامل

A note on semi-regular locales

Semi-regular locales are extensions of the classical semiregular spaces. We investigate the conditions such that semi-regularization is a functor. We also investigate the conditions such that semi-regularization is a reflection or coreflection.

متن کامل

Every (λ, Κ)-regular Ultrafilter Is (λ, Κ)-regular

We prove the following: Theorem A. If D is a (λ+, κ)-regular ultrafilter, then either (a) D is (λ, κ)-regular, or (b) the cofinality of the linear order ∏ D〈λ, <〉 is cf κ, and D is (λ, κ′)-regular for all κ′ < κ. Corollary B. Suppose that κ is singular, κ > λ and either λ is regular, or cf κ < cf λ. Then every (λ+n, κ)-regular ultrafilter is (λ, κ)-regular. We also discuss some consequences and...

متن کامل

Regular, pseudo-regular, and almost regular matrices

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Ho¤man, Wolfe, and Ho¤...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nagoya Mathematical Journal

سال: 1975

ISSN: 0027-7630,2152-6842

DOI: 10.1017/s0027763000019474